On the inverse mean first passage matrix problem and the inverse M-matrix problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولThe M–matrix Moore–Penrose inverse problem for weighted paths
Abstract. A well–known property of an irreducible non–singular M–matrix is that its inverse is non–negative. However, when the matrix is an irreducible and singular M–matrix it is known that it has a generalized inverse which is non–negative, but this is not always true for any generalized inverse. We focus here in characterizing when the Moore–Penrose inverse of a symmetric, singular, irreduci...
متن کاملMatrix representation of a sixth order Sturm-Liouville problem and related inverse problem with finite spectrum
In this paper, we find matrix representation of a class of sixth order Sturm-Liouville problem (SLP) with separated, self-adjoint boundary conditions and we show that such SLP have finite spectrum. Also for a given matrix eigenvalue problem $HX=lambda VX$, where $H$ is a block tridiagonal matrix and $V$ is a block diagonal matrix, we find a sixth order boundary value problem of Atkin...
متن کاملThe Inverse First-passage Problem and Optimal Stopping
Given a survival distribution on the positive half-axis and a Brownian motion, a solution of the inverse first-passage problem consists of a boundary so that the first passage time over the boundary has the given distribution. We show that the solution of the inverse firstpassage problem coincides with the solution of a related optimal stopping problem. Consequently, methods from optimal stoppi...
متن کاملM-Matrix Inverse problem for distance-regular graphs
We analyze when the Moore–Penrose inverse of the combinatorial Laplacian of a distance– regular graph is a M–matrix; that is, it has non–positive off–diagonal elements. In particular, our results include some previously known results on strongly regular graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2011
ISSN: 0024-3795
DOI: 10.1016/j.laa.2010.02.019